Verifying and Invalidating Textbook Proofs Using Scunak
نویسنده
چکیده
Many textbook proofs are essentially human-readable representations of natural deduction proofs. Terms in dependent type theory provide formally checkable representations of natural deduction proofs. We show how the new mathematical assistant system Scunak can be used to verify a textbook proof by translating the LTEX version into a proof term in a dependent type theory. We also show how Scunak can give interesting output upon failure.
منابع مشابه
Structuring textbook proofs
Topic Areas or Theme ID: discourse analysis, discourse segmentation, discourse plans Word Count: 3196 words (excluding gures) Under consideration for other conferences (specify)? No. Abstract We propose a promising research problem, the machine veriication of textbook proofs. It shows that textbook proofs are a suuciently complex and highly struc-tured form of discourse, embedded in a well-deen...
متن کاملMizar Correctness Proofs of Generic Fraction Field Arithmetic
We propose the Mizar system as a theorem prover capable of verifying generic algebraic algorithms on an appropriate abstract level. The main advantage of the Mizar theorem prover is its special proof script language that enables textbook style presentation of proofs, hence allowing proofs in the language of algebra. Using Mizar we were able to give a rigorous machine assisted correctness proof ...
متن کاملEncoding Functional Relations in Scunak
We describe how a set-theoretic foundation for mathematics can be encoded in the new system Scunak. We then discuss an encoding of the construction of functions as functional relations in untyped set theory. Using the dependent type theory of Scunak, we can define object level application and lambda abstraction operators (in the spirit of higher-order abstract syntax) mediating between function...
متن کاملLearning how to Prove: From the Coq Proof Assistant to Textbook Style
We have developed an alternative approach to teaching computer science students how to prove. First, students are taught how to prove theorems with the Coq proof assistant. In a second, more difficult, step students will transfer their acquired skills to the area of textbook proofs. In this article we present a realisation of the second step. Proofs in Coq have a high degree of formality while ...
متن کاملA Drt-based Approach for Formula Parsing in Textbook Proofs
Knowledge is essential for understanding discourse. Generally, this has to be common sense knowledge and therefore, discourse understanding is hard. For the understanding of textbook proofs, however, only a limited quantity of knowledge is necessary. In addition, we have gained something very essential: inference. A prerequisite for parsing textbook proofs is to being able to parse formulae tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006